On Invariance Principles for Distributed Parameter Identification Algorithms

We consider a class of identification algorithms for distributed parameter systems. Utilizing stochastic optimization techniques, sequences of estimat.ors are constructed by minimizing appropriate functionals. The main effort is to devel.. Using the model to predict population size 100 On invariance principles for resource management requires fitting data to determine the parameters. To recover or identify the parameters in any of these examples, one needs to use observations. More often than not, such observations are corrupted with noise. In Fitzpatrick (1988) and Banks and Fitzpatrick (1990), a general nonlinear least squares type of algorithm was proposed for the distributed parameter identification problems. II;l Banks and Fitzpatrick (1989), Fitzpatrick (1988), Banks .and Fitzpatrick (1990), the effects of noisy observations on the class of stochastic optimization and parameter estimation procedures w~reanalyzed. In particular, consistency and asymptotic normality were established, with a primary objective of developing appropriate statistics for hypothesis tests. This work complements the papers of Fitzpatrick (1988), Banks and Fitzpatrick (1990) by developing weak and strong functional invariance principles of the least squares algorithms for distributed parameter identification. Our main concerns are to investigate further the asymptotic properties and to develop rate of convergence result~. The importance of these results for applications is obvious: the a;nount of data required to achieve s~me specified estimation accu~acy would be very helpful information for designing experiments. i Functional central limit theorems and functional laws of iterated logarithms 'have played important roles in statistical estimation theory involving large samples. In (Heyde, 1981), Heyde gives an extensive survey on the usefulness and recent pmgress in these invariance theorems, which both use and extend the interplay between statistical estimation and stochastic processes. The results to be presented in the sequel deal with the convergence of functions constructed out of the sequence of least squares estimators (suitably scaled), and provide portmanteau forms from which other limit theorems may be obtained. A wide range oflimit distribution results involving functionals of the sequence of estimators can be inferred by employing the weak invariance principle. and the "with probability one" convergence rate of the algorithm G. Yin and B. G. Fitzpatrick 101 can be derived by virtue of the strong invariance theorem. These results provide us with further insight on the behavior of the nonlinear least squares type of stochastic optimization and identification algorithms. The rest of. the paper is organized as follows. In the next section, we set up the notations, and summarize some previous results. Section 3 is devoted to the weak convergence issue. Under suitable conditions, we show an appropriately scaled sequence converges weakly to a Brownian motion. Exploiting this function space setting further, we derive an almost sure estimate on the error bound in Section 4. As a consequence, the functional law of iterated logarithm holds. To proceed, a brief explanation about the notations is in order. We shall use" I" to denote the transpose of a matrix and use J{ to denote a generic positive constant; its value may change from time to time. The short hand notion "w.p.P is meant to be "with probability one". 2. The general least squares problem. We begin this section by setting up the least squares identifica.tion problem. Let X be a compa.ct subset of Rm , 9 : X -+ R be an unknown continuous function. Wc make a sequence of observations {li} with